./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c --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/bitvector/soft_float_4-3a.c.cil.c -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 c7e459611ed6ff9d4c49aa04980ca7f1d5aaaf97e8fc0116c264955df4ed453a --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 10:22:50,363 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 10:22:50,424 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 10:22:50,428 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 10:22:50,428 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 10:22:50,452 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 10:22:50,453 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 10:22:50,453 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 10:22:50,454 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 10:22:50,454 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 10:22:50,455 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 10:22:50,455 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 10:22:50,455 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 10:22:50,456 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 10:22:50,456 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 10:22:50,457 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 10:22:50,457 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 10:22:50,457 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 10:22:50,458 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 10:22:50,458 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 10:22:50,458 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 10:22:50,459 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 10:22:50,459 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 10:22:50,459 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 10:22:50,460 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 10:22:50,460 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 10:22:50,460 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 10:22:50,461 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 10:22:50,461 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 10:22:50,461 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 10:22:50,461 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 10:22:50,462 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 10:22:50,462 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:22:50,462 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 10:22:50,462 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 10:22:50,463 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 10:22:50,463 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 10:22:50,463 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 10:22:50,463 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 10:22:50,463 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 10:22:50,464 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 10:22:50,464 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 10:22:50,464 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 -> c7e459611ed6ff9d4c49aa04980ca7f1d5aaaf97e8fc0116c264955df4ed453a [2024-11-08 10:22:50,694 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 10:22:50,718 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 10:22:50,721 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 10:22:50,722 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 10:22:50,722 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 10:22:50,723 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2024-11-08 10:22:52,079 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 10:22:52,262 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 10:22:52,262 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2024-11-08 10:22:52,274 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49b9824f7/3ac8d9d9bd5a427fb0bbb555b155f410/FLAGd3b437ecf [2024-11-08 10:22:52,633 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49b9824f7/3ac8d9d9bd5a427fb0bbb555b155f410 [2024-11-08 10:22:52,635 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 10:22:52,636 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 10:22:52,639 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 10:22:52,639 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 10:22:52,643 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 10:22:52,643 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:22:52" (1/1) ... [2024-11-08 10:22:52,644 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56d958af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:52, skipping insertion in model container [2024-11-08 10:22:52,644 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:22:52" (1/1) ... [2024-11-08 10:22:52,672 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 10:22:52,828 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/bitvector/soft_float_4-3a.c.cil.c[730,743] [2024-11-08 10:22:52,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:22:52,901 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 10:22:52,910 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/bitvector/soft_float_4-3a.c.cil.c[730,743] [2024-11-08 10:22:52,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:22:52,949 INFO L204 MainTranslator]: Completed translation [2024-11-08 10:22:52,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:52 WrapperNode [2024-11-08 10:22:52,949 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 10:22:52,950 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 10:22:52,950 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 10:22:52,950 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 10:22:52,955 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:52" (1/1) ... [2024-11-08 10:22:52,962 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:52" (1/1) ... [2024-11-08 10:22:52,976 INFO L138 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 56 [2024-11-08 10:22:52,977 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 10:22:52,977 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 10:22:52,977 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 10:22:52,977 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 10:22:52,986 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:52" (1/1) ... [2024-11-08 10:22:52,986 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:52" (1/1) ... [2024-11-08 10:22:52,988 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:52" (1/1) ... [2024-11-08 10:22:52,999 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 10:22:52,999 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:52" (1/1) ... [2024-11-08 10:22:52,999 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:52" (1/1) ... [2024-11-08 10:22:53,004 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:52" (1/1) ... [2024-11-08 10:22:53,011 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:52" (1/1) ... [2024-11-08 10:22:53,013 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:52" (1/1) ... [2024-11-08 10:22:53,017 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:52" (1/1) ... [2024-11-08 10:22:53,019 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 10:22:53,020 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 10:22:53,020 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 10:22:53,020 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 10:22:53,022 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:52" (1/1) ... [2024-11-08 10:22:53,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:22:53,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:22:53,060 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 10:22:53,066 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 10:22:53,114 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 10:22:53,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 10:22:53,114 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-11-08 10:22:53,114 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-11-08 10:22:53,114 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 10:22:53,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 10:22:53,115 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2024-11-08 10:22:53,116 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2024-11-08 10:22:53,116 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-08 10:22:53,116 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-08 10:22:53,204 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 10:22:53,208 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 10:22:53,520 INFO L? ?]: Removed 52 outVars from TransFormulas that were not future-live. [2024-11-08 10:22:53,520 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 10:22:53,532 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 10:22:53,533 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-08 10:22:53,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:22:53 BoogieIcfgContainer [2024-11-08 10:22:53,533 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 10:22:53,536 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 10:22:53,537 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 10:22:53,540 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 10:22:53,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:22:52" (1/3) ... [2024-11-08 10:22:53,542 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5317026e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:22:53, skipping insertion in model container [2024-11-08 10:22:53,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:22:52" (2/3) ... [2024-11-08 10:22:53,542 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5317026e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:22:53, skipping insertion in model container [2024-11-08 10:22:53,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:22:53" (3/3) ... [2024-11-08 10:22:53,544 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_4-3a.c.cil.c [2024-11-08 10:22:53,560 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 10:22:53,560 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 10:22:53,604 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 10:22:53,609 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;@4720b273, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 10:22:53,610 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 10:22:53,613 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 64 states have (on average 1.5) internal successors, (96), 65 states have internal predecessors, (96), 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 10:22:53,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-08 10:22:53,620 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:53,621 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, 1] [2024-11-08 10:22:53,621 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:53,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:53,625 INFO L85 PathProgramCache]: Analyzing trace with hash 453789429, now seen corresponding path program 1 times [2024-11-08 10:22:53,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:53,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648327045] [2024-11-08 10:22:53,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:53,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:53,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:54,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:22:54,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:54,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:22:54,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:54,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 10:22:54,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:54,322 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 10:22:54,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:54,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648327045] [2024-11-08 10:22:54,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648327045] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:22:54,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686472060] [2024-11-08 10:22:54,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:54,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:22:54,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:22:54,328 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 10:22:54,330 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 10:22:54,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:54,430 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-08 10:22:54,438 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:22:54,492 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 10:22:54,494 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:22:54,683 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 10:22:54,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686472060] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:22:54,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 10:22:54,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2024-11-08 10:22:54,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809712504] [2024-11-08 10:22:54,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 10:22:54,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 10:22:54,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:54,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 10:22:54,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2024-11-08 10:22:54,722 INFO L87 Difference]: Start difference. First operand has 78 states, 64 states have (on average 1.5) internal successors, (96), 65 states have internal predecessors, (96), 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 16 states, 16 states have (on average 1.875) internal successors, (30), 12 states have internal predecessors, (30), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-08 10:22:54,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:54,933 INFO L93 Difference]: Finished difference Result 176 states and 271 transitions. [2024-11-08 10:22:54,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 10:22:54,939 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 12 states have internal predecessors, (30), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 35 [2024-11-08 10:22:54,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:54,949 INFO L225 Difference]: With dead ends: 176 [2024-11-08 10:22:54,949 INFO L226 Difference]: Without dead ends: 95 [2024-11-08 10:22:54,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2024-11-08 10:22:54,955 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 25 mSDsluCounter, 1181 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 1281 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:54,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 1281 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:22:54,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-08 10:22:55,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 87. [2024-11-08 10:22:55,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 70 states have (on average 1.3714285714285714) internal successors, (96), 72 states have internal predecessors, (96), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2024-11-08 10:22:55,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 121 transitions. [2024-11-08 10:22:55,009 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 121 transitions. Word has length 35 [2024-11-08 10:22:55,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:55,012 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 121 transitions. [2024-11-08 10:22:55,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 12 states have internal predecessors, (30), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-08 10:22:55,013 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 121 transitions. [2024-11-08 10:22:55,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 10:22:55,017 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:55,017 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:22:55,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 10:22:55,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-08 10:22:55,218 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:55,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:55,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1079320092, now seen corresponding path program 1 times [2024-11-08 10:22:55,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:55,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101622908] [2024-11-08 10:22:55,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:55,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:55,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:55,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:22:55,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:55,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:22:55,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:55,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 10:22:55,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:55,434 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 10:22:55,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:55,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101622908] [2024-11-08 10:22:55,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101622908] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:55,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:55,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 10:22:55,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394054150] [2024-11-08 10:22:55,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:55,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 10:22:55,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:55,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 10:22:55,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-08 10:22:55,441 INFO L87 Difference]: Start difference. First operand 87 states and 121 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:22:55,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:55,519 INFO L93 Difference]: Finished difference Result 159 states and 216 transitions. [2024-11-08 10:22:55,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 10:22:55,520 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2024-11-08 10:22:55,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:55,522 INFO L225 Difference]: With dead ends: 159 [2024-11-08 10:22:55,522 INFO L226 Difference]: Without dead ends: 110 [2024-11-08 10:22:55,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-08 10:22:55,526 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 13 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:55,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 670 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:22:55,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-08 10:22:55,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 95. [2024-11-08 10:22:55,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 76 states have (on average 1.3421052631578947) internal successors, (102), 78 states have internal predecessors, (102), 12 states have call successors, (12), 5 states have call predecessors, (12), 6 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2024-11-08 10:22:55,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 129 transitions. [2024-11-08 10:22:55,549 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 129 transitions. Word has length 39 [2024-11-08 10:22:55,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:55,549 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 129 transitions. [2024-11-08 10:22:55,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:22:55,550 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 129 transitions. [2024-11-08 10:22:55,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-08 10:22:55,554 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:55,554 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:22:55,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 10:22:55,555 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:55,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:55,556 INFO L85 PathProgramCache]: Analyzing trace with hash -879159838, now seen corresponding path program 1 times [2024-11-08 10:22:55,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:55,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077617560] [2024-11-08 10:22:55,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:55,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:55,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:55,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:22:55,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:55,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:22:55,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:55,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 10:22:55,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:55,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 10:22:55,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:55,791 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 10:22:55,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:55,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077617560] [2024-11-08 10:22:55,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077617560] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:55,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:55,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 10:22:55,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588531878] [2024-11-08 10:22:55,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:55,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 10:22:55,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:55,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 10:22:55,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-08 10:22:55,798 INFO L87 Difference]: Start difference. First operand 95 states and 129 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-08 10:22:55,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:55,920 INFO L93 Difference]: Finished difference Result 178 states and 244 transitions. [2024-11-08 10:22:55,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 10:22:55,921 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 43 [2024-11-08 10:22:55,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:55,923 INFO L225 Difference]: With dead ends: 178 [2024-11-08 10:22:55,923 INFO L226 Difference]: Without dead ends: 138 [2024-11-08 10:22:55,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-08 10:22:55,924 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 83 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:55,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 789 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:22:55,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-08 10:22:55,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 130. [2024-11-08 10:22:55,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 106 states have (on average 1.3584905660377358) internal successors, (144), 108 states have internal predecessors, (144), 16 states have call successors, (16), 6 states have call predecessors, (16), 7 states have return successors, (19), 15 states have call predecessors, (19), 15 states have call successors, (19) [2024-11-08 10:22:55,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 179 transitions. [2024-11-08 10:22:55,937 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 179 transitions. Word has length 43 [2024-11-08 10:22:55,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:55,937 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 179 transitions. [2024-11-08 10:22:55,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-08 10:22:55,937 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 179 transitions. [2024-11-08 10:22:55,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-08 10:22:55,939 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:55,939 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:22:55,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 10:22:55,940 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:55,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:55,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1272186848, now seen corresponding path program 1 times [2024-11-08 10:22:55,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:55,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244696953] [2024-11-08 10:22:55,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:55,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:55,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:56,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:22:56,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:56,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:22:56,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:56,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 10:22:56,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:56,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 10:22:56,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:56,130 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 10:22:56,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:56,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244696953] [2024-11-08 10:22:56,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244696953] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:22:56,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104712831] [2024-11-08 10:22:56,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:56,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:22:56,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:22:56,134 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 10:22:56,137 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 10:22:56,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:56,204 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-08 10:22:56,206 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:22:56,244 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 10:22:56,244 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:22:56,395 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 10:22:56,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104712831] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:22:56,396 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 10:22:56,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2024-11-08 10:22:56,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454380456] [2024-11-08 10:22:56,397 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 10:22:56,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 10:22:56,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:56,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 10:22:56,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-08 10:22:56,400 INFO L87 Difference]: Start difference. First operand 130 states and 179 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 10 states have internal predecessors, (37), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-08 10:22:56,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:56,490 INFO L93 Difference]: Finished difference Result 224 states and 308 transitions. [2024-11-08 10:22:56,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 10:22:56,490 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 10 states have internal predecessors, (37), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 43 [2024-11-08 10:22:56,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:56,492 INFO L225 Difference]: With dead ends: 224 [2024-11-08 10:22:56,492 INFO L226 Difference]: Without dead ends: 153 [2024-11-08 10:22:56,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-08 10:22:56,493 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 16 mSDsluCounter, 900 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:56,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1002 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:22:56,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-08 10:22:56,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 140. [2024-11-08 10:22:56,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 113 states have (on average 1.336283185840708) internal successors, (151), 115 states have internal predecessors, (151), 18 states have call successors, (18), 7 states have call predecessors, (18), 8 states have return successors, (21), 17 states have call predecessors, (21), 17 states have call successors, (21) [2024-11-08 10:22:56,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 190 transitions. [2024-11-08 10:22:56,514 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 190 transitions. Word has length 43 [2024-11-08 10:22:56,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:56,514 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 190 transitions. [2024-11-08 10:22:56,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 10 states have internal predecessors, (37), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-08 10:22:56,514 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 190 transitions. [2024-11-08 10:22:56,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-08 10:22:56,516 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:56,516 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:22:56,532 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 10:22:56,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-08 10:22:56,717 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:56,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:56,717 INFO L85 PathProgramCache]: Analyzing trace with hash -642851046, now seen corresponding path program 1 times [2024-11-08 10:22:56,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:56,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183272238] [2024-11-08 10:22:56,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:56,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:56,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:56,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:22:56,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:56,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:22:56,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:56,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 10:22:56,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:56,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 10:22:56,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:57,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-08 10:22:57,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:57,094 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 10:22:57,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:57,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183272238] [2024-11-08 10:22:57,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183272238] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:57,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:57,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-08 10:22:57,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452879258] [2024-11-08 10:22:57,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:57,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 10:22:57,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:57,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 10:22:57,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2024-11-08 10:22:57,097 INFO L87 Difference]: Start difference. First operand 140 states and 190 transitions. Second operand has 15 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-08 10:22:57,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:57,338 INFO L93 Difference]: Finished difference Result 203 states and 273 transitions. [2024-11-08 10:22:57,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 10:22:57,339 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 44 [2024-11-08 10:22:57,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:57,341 INFO L225 Difference]: With dead ends: 203 [2024-11-08 10:22:57,341 INFO L226 Difference]: Without dead ends: 195 [2024-11-08 10:22:57,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2024-11-08 10:22:57,342 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 56 mSDsluCounter, 1092 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 1194 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:57,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 1194 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 10:22:57,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-08 10:22:57,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 145. [2024-11-08 10:22:57,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 117 states have (on average 1.3247863247863247) internal successors, (155), 118 states have internal predecessors, (155), 19 states have call successors, (19), 7 states have call predecessors, (19), 8 states have return successors, (22), 19 states have call predecessors, (22), 18 states have call successors, (22) [2024-11-08 10:22:57,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 196 transitions. [2024-11-08 10:22:57,368 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 196 transitions. Word has length 44 [2024-11-08 10:22:57,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:57,369 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 196 transitions. [2024-11-08 10:22:57,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-08 10:22:57,369 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 196 transitions. [2024-11-08 10:22:57,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-08 10:22:57,371 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:57,371 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:22:57,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 10:22:57,372 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:57,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:57,373 INFO L85 PathProgramCache]: Analyzing trace with hash 879448533, now seen corresponding path program 2 times [2024-11-08 10:22:57,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:57,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666819066] [2024-11-08 10:22:57,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:57,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:57,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:57,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:22:57,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:57,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:22:57,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:57,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 10:22:57,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:57,537 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 10:22:57,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:57,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666819066] [2024-11-08 10:22:57,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666819066] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:22:57,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659068980] [2024-11-08 10:22:57,538 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 10:22:57,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:22:57,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:22:57,540 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 10:22:57,542 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 10:22:57,601 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-08 10:22:57,602 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 10:22:57,603 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-08 10:22:57,606 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:22:57,747 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 10:22:57,747 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:22:57,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [659068980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:57,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:22:57,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 13 [2024-11-08 10:22:57,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292516203] [2024-11-08 10:22:57,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:57,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 10:22:57,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:57,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 10:22:57,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2024-11-08 10:22:57,750 INFO L87 Difference]: Start difference. First operand 145 states and 196 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:22:57,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:57,967 INFO L93 Difference]: Finished difference Result 286 states and 391 transitions. [2024-11-08 10:22:57,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 10:22:57,967 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2024-11-08 10:22:57,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:57,969 INFO L225 Difference]: With dead ends: 286 [2024-11-08 10:22:57,969 INFO L226 Difference]: Without dead ends: 229 [2024-11-08 10:22:57,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2024-11-08 10:22:57,971 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 95 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 1238 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:57,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 1238 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:22:57,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-11-08 10:22:57,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 192. [2024-11-08 10:22:57,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 156 states have (on average 1.3205128205128205) internal successors, (206), 158 states have internal predecessors, (206), 24 states have call successors, (24), 9 states have call predecessors, (24), 11 states have return successors, (31), 24 states have call predecessors, (31), 23 states have call successors, (31) [2024-11-08 10:22:57,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 261 transitions. [2024-11-08 10:22:57,994 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 261 transitions. Word has length 43 [2024-11-08 10:22:57,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:57,995 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 261 transitions. [2024-11-08 10:22:57,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:22:57,995 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 261 transitions. [2024-11-08 10:22:57,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-08 10:22:57,996 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:57,996 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:22:58,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-08 10:22:58,201 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 10:22:58,202 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:58,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:58,202 INFO L85 PathProgramCache]: Analyzing trace with hash 486421523, now seen corresponding path program 1 times [2024-11-08 10:22:58,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:58,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105572933] [2024-11-08 10:22:58,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:58,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:58,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:58,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:22:58,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:58,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:22:58,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:58,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 10:22:58,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:58,604 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 10:22:58,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:58,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105572933] [2024-11-08 10:22:58,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105572933] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:58,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:58,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-08 10:22:58,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189029278] [2024-11-08 10:22:58,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:58,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 10:22:58,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:58,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 10:22:58,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-08 10:22:58,607 INFO L87 Difference]: Start difference. First operand 192 states and 261 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 9 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:22:58,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:58,805 INFO L93 Difference]: Finished difference Result 207 states and 279 transitions. [2024-11-08 10:22:58,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 10:22:58,808 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 9 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2024-11-08 10:22:58,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:58,809 INFO L225 Difference]: With dead ends: 207 [2024-11-08 10:22:58,809 INFO L226 Difference]: Without dead ends: 205 [2024-11-08 10:22:58,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2024-11-08 10:22:58,810 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 72 mSDsluCounter, 1076 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 1191 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:58,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 1191 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:22:58,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-08 10:22:58,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 196. [2024-11-08 10:22:58,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 159 states have (on average 1.3144654088050314) internal successors, (209), 161 states have internal predecessors, (209), 24 states have call successors, (24), 10 states have call predecessors, (24), 12 states have return successors, (31), 24 states have call predecessors, (31), 23 states have call successors, (31) [2024-11-08 10:22:58,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 264 transitions. [2024-11-08 10:22:58,831 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 264 transitions. Word has length 43 [2024-11-08 10:22:58,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:58,831 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 264 transitions. [2024-11-08 10:22:58,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 9 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:22:58,832 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 264 transitions. [2024-11-08 10:22:58,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-08 10:22:58,832 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:58,834 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:22:58,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 10:22:58,834 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:58,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:58,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1201861858, now seen corresponding path program 1 times [2024-11-08 10:22:58,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:58,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933923297] [2024-11-08 10:22:58,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:58,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:58,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:58,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:22:58,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:58,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:22:58,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:58,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 10:22:58,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:58,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 10:22:58,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:58,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-08 10:22:58,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:58,920 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-08 10:22:58,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:58,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933923297] [2024-11-08 10:22:58,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933923297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:22:58,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:22:58,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 10:22:58,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587032100] [2024-11-08 10:22:58,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:22:58,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 10:22:58,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:58,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 10:22:58,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 10:22:58,922 INFO L87 Difference]: Start difference. First operand 196 states and 264 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-08 10:22:58,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:22:58,954 INFO L93 Difference]: Finished difference Result 204 states and 271 transitions. [2024-11-08 10:22:58,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 10:22:58,955 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 46 [2024-11-08 10:22:58,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:22:58,956 INFO L225 Difference]: With dead ends: 204 [2024-11-08 10:22:58,956 INFO L226 Difference]: Without dead ends: 189 [2024-11-08 10:22:58,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 10:22:58,957 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 3 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:22:58,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 491 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:22:58,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-11-08 10:22:58,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2024-11-08 10:22:58,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 154 states have (on average 1.3181818181818181) internal successors, (203), 157 states have internal predecessors, (203), 22 states have call successors, (22), 10 states have call predecessors, (22), 12 states have return successors, (28), 21 states have call predecessors, (28), 21 states have call successors, (28) [2024-11-08 10:22:58,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 253 transitions. [2024-11-08 10:22:58,967 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 253 transitions. Word has length 46 [2024-11-08 10:22:58,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:22:58,968 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 253 transitions. [2024-11-08 10:22:58,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-08 10:22:58,968 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 253 transitions. [2024-11-08 10:22:58,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-08 10:22:58,969 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:22:58,969 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:22:58,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 10:22:58,969 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:22:58,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:22:58,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1225681735, now seen corresponding path program 1 times [2024-11-08 10:22:58,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:22:58,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528021545] [2024-11-08 10:22:58,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:58,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:22:58,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:59,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:22:59,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:59,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:22:59,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:59,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 10:22:59,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:59,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 10:22:59,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:59,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 10:22:59,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:59,174 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 10:22:59,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:22:59,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528021545] [2024-11-08 10:22:59,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528021545] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:22:59,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777252004] [2024-11-08 10:22:59,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:22:59,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:22:59,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:22:59,177 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 10:22:59,178 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 10:22:59,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:22:59,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-08 10:22:59,241 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:22:59,424 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-08 10:22:59,424 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:22:59,842 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 10:22:59,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777252004] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:22:59,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 10:22:59,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17, 13] total 32 [2024-11-08 10:22:59,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166032895] [2024-11-08 10:22:59,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 10:22:59,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-08 10:22:59,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:22:59,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-08 10:22:59,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=904, Unknown=0, NotChecked=0, Total=992 [2024-11-08 10:22:59,845 INFO L87 Difference]: Start difference. First operand 189 states and 253 transitions. Second operand has 32 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 25 states have internal predecessors, (50), 6 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-08 10:23:01,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:01,436 INFO L93 Difference]: Finished difference Result 404 states and 573 transitions. [2024-11-08 10:23:01,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-11-08 10:23:01,437 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 25 states have internal predecessors, (50), 6 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) Word has length 48 [2024-11-08 10:23:01,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:01,440 INFO L225 Difference]: With dead ends: 404 [2024-11-08 10:23:01,440 INFO L226 Difference]: Without dead ends: 379 [2024-11-08 10:23:01,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=327, Invalid=3579, Unknown=0, NotChecked=0, Total=3906 [2024-11-08 10:23:01,442 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 282 mSDsluCounter, 4046 mSDsCounter, 0 mSdLazyCounter, 1230 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 4243 SdHoareTripleChecker+Invalid, 1309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:01,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 4243 Invalid, 1309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1230 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 10:23:01,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-11-08 10:23:01,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 234. [2024-11-08 10:23:01,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 189 states have (on average 1.3015873015873016) internal successors, (246), 196 states have internal predecessors, (246), 28 states have call successors, (28), 9 states have call predecessors, (28), 16 states have return successors, (45), 28 states have call predecessors, (45), 27 states have call successors, (45) [2024-11-08 10:23:01,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 319 transitions. [2024-11-08 10:23:01,470 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 319 transitions. Word has length 48 [2024-11-08 10:23:01,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:01,471 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 319 transitions. [2024-11-08 10:23:01,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 25 states have internal predecessors, (50), 6 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-08 10:23:01,471 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 319 transitions. [2024-11-08 10:23:01,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-08 10:23:01,472 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:01,472 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:01,490 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 10:23:01,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:23:01,677 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:01,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:01,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1683702903, now seen corresponding path program 2 times [2024-11-08 10:23:01,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:01,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840377191] [2024-11-08 10:23:01,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:01,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:01,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:01,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:23:01,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:01,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:23:01,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:01,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 10:23:01,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:01,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 10:23:01,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:01,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 10:23:01,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:01,910 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 10:23:01,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:01,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840377191] [2024-11-08 10:23:01,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840377191] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:23:01,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122784731] [2024-11-08 10:23:01,911 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 10:23:01,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:23:01,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:23:01,913 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 10:23:01,916 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 10:23:01,977 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 10:23:01,977 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 10:23:01,982 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-08 10:23:01,984 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:23:02,155 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-08 10:23:02,155 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:23:02,562 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 10:23:02,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122784731] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:23:02,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 10:23:02,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17, 13] total 32 [2024-11-08 10:23:02,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850911672] [2024-11-08 10:23:02,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 10:23:02,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-08 10:23:02,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:02,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-08 10:23:02,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=904, Unknown=0, NotChecked=0, Total=992 [2024-11-08 10:23:02,566 INFO L87 Difference]: Start difference. First operand 234 states and 319 transitions. Second operand has 32 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 25 states have internal predecessors, (51), 6 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 9 states have call predecessors, (11), 5 states have call successors, (11) [2024-11-08 10:23:03,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:03,944 INFO L93 Difference]: Finished difference Result 453 states and 683 transitions. [2024-11-08 10:23:03,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-08 10:23:03,944 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 25 states have internal predecessors, (51), 6 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 9 states have call predecessors, (11), 5 states have call successors, (11) Word has length 48 [2024-11-08 10:23:03,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:03,947 INFO L225 Difference]: With dead ends: 453 [2024-11-08 10:23:03,947 INFO L226 Difference]: Without dead ends: 438 [2024-11-08 10:23:03,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=295, Invalid=3245, Unknown=0, NotChecked=0, Total=3540 [2024-11-08 10:23:03,949 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 361 mSDsluCounter, 3047 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 3217 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:03,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 3217 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 967 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 10:23:03,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2024-11-08 10:23:03,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 257. [2024-11-08 10:23:03,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 203 states have (on average 1.2807881773399015) internal successors, (260), 212 states have internal predecessors, (260), 34 states have call successors, (34), 10 states have call predecessors, (34), 19 states have return successors, (69), 34 states have call predecessors, (69), 33 states have call successors, (69) [2024-11-08 10:23:03,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 363 transitions. [2024-11-08 10:23:03,974 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 363 transitions. Word has length 48 [2024-11-08 10:23:03,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:03,975 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 363 transitions. [2024-11-08 10:23:03,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 25 states have internal predecessors, (51), 6 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 9 states have call predecessors, (11), 5 states have call successors, (11) [2024-11-08 10:23:03,975 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 363 transitions. [2024-11-08 10:23:03,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-08 10:23:03,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:03,976 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:03,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-08 10:23:04,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-08 10:23:04,181 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:04,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:04,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1187408652, now seen corresponding path program 1 times [2024-11-08 10:23:04,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:04,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977322626] [2024-11-08 10:23:04,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:04,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:04,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:04,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:23:04,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:04,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:23:04,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:04,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 10:23:04,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:04,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 10:23:04,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:04,338 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 10:23:04,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:04,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977322626] [2024-11-08 10:23:04,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977322626] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:23:04,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288247642] [2024-11-08 10:23:04,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:04,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:23:04,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:23:04,341 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 10:23:04,342 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 10:23:04,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:04,411 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-08 10:23:04,417 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:23:04,594 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-08 10:23:04,594 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:23:04,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288247642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:04,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:23:04,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [9] total 18 [2024-11-08 10:23:04,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36112950] [2024-11-08 10:23:04,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:04,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 10:23:04,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:04,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 10:23:04,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2024-11-08 10:23:04,596 INFO L87 Difference]: Start difference. First operand 257 states and 363 transitions. Second operand has 15 states, 12 states have (on average 2.5) internal successors, (30), 11 states have internal predecessors, (30), 5 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 10:23:04,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:04,869 INFO L93 Difference]: Finished difference Result 487 states and 689 transitions. [2024-11-08 10:23:04,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 10:23:04,870 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 2.5) internal successors, (30), 11 states have internal predecessors, (30), 5 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 49 [2024-11-08 10:23:04,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:04,872 INFO L225 Difference]: With dead ends: 487 [2024-11-08 10:23:04,873 INFO L226 Difference]: Without dead ends: 363 [2024-11-08 10:23:04,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2024-11-08 10:23:04,874 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 63 mSDsluCounter, 1669 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 1819 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:04,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 1819 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 10:23:04,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2024-11-08 10:23:04,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 331. [2024-11-08 10:23:04,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 265 states have (on average 1.2830188679245282) internal successors, (340), 274 states have internal predecessors, (340), 42 states have call successors, (42), 14 states have call predecessors, (42), 23 states have return successors, (74), 42 states have call predecessors, (74), 41 states have call successors, (74) [2024-11-08 10:23:04,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 456 transitions. [2024-11-08 10:23:04,901 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 456 transitions. Word has length 49 [2024-11-08 10:23:04,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:04,902 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 456 transitions. [2024-11-08 10:23:04,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 2.5) internal successors, (30), 11 states have internal predecessors, (30), 5 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 10:23:04,903 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 456 transitions. [2024-11-08 10:23:04,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-08 10:23:04,904 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:04,904 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:04,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-08 10:23:05,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:23:05,105 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:05,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:05,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1377180783, now seen corresponding path program 1 times [2024-11-08 10:23:05,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:05,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540246870] [2024-11-08 10:23:05,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:05,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:05,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:05,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:23:05,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:05,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:23:05,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:05,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 10:23:05,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:05,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 10:23:05,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:05,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 10:23:05,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:05,219 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-08 10:23:05,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:05,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540246870] [2024-11-08 10:23:05,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540246870] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:23:05,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910744613] [2024-11-08 10:23:05,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:05,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:23:05,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:23:05,222 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:23:05,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-08 10:23:05,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:05,278 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-08 10:23:05,280 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:23:05,382 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-08 10:23:05,382 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:23:05,628 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 10:23:05,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910744613] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:23:05,628 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 10:23:05,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 10] total 21 [2024-11-08 10:23:05,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132298512] [2024-11-08 10:23:05,629 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 10:23:05,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-08 10:23:05,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:05,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-08 10:23:05,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2024-11-08 10:23:05,630 INFO L87 Difference]: Start difference. First operand 331 states and 456 transitions. Second operand has 21 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 18 states have internal predecessors, (58), 5 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 7 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-08 10:23:06,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:06,144 INFO L93 Difference]: Finished difference Result 496 states and 716 transitions. [2024-11-08 10:23:06,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-08 10:23:06,145 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 18 states have internal predecessors, (58), 5 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 7 states have call predecessors, (11), 4 states have call successors, (11) Word has length 50 [2024-11-08 10:23:06,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:06,147 INFO L225 Difference]: With dead ends: 496 [2024-11-08 10:23:06,147 INFO L226 Difference]: Without dead ends: 471 [2024-11-08 10:23:06,148 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=808, Unknown=0, NotChecked=0, Total=930 [2024-11-08 10:23:06,150 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 132 mSDsluCounter, 1937 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 2074 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:06,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 2074 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 10:23:06,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2024-11-08 10:23:06,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 343. [2024-11-08 10:23:06,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 272 states have (on average 1.2683823529411764) internal successors, (345), 283 states have internal predecessors, (345), 45 states have call successors, (45), 14 states have call predecessors, (45), 25 states have return successors, (92), 45 states have call predecessors, (92), 44 states have call successors, (92) [2024-11-08 10:23:06,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 482 transitions. [2024-11-08 10:23:06,175 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 482 transitions. Word has length 50 [2024-11-08 10:23:06,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:06,175 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 482 transitions. [2024-11-08 10:23:06,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 18 states have internal predecessors, (58), 5 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 7 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-08 10:23:06,175 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 482 transitions. [2024-11-08 10:23:06,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-08 10:23:06,177 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:06,177 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:06,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-08 10:23:06,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:23:06,382 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:06,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:06,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1213879945, now seen corresponding path program 1 times [2024-11-08 10:23:06,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:06,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456446106] [2024-11-08 10:23:06,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:06,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:06,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:06,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:23:06,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:06,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:23:06,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:06,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 10:23:06,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:06,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-08 10:23:06,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:06,428 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 10:23:06,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:06,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456446106] [2024-11-08 10:23:06,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456446106] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:23:06,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560001375] [2024-11-08 10:23:06,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:06,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:23:06,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:23:06,431 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:23:06,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-08 10:23:06,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:06,490 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 10:23:06,492 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:23:06,506 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 10:23:06,507 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:23:06,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560001375] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:06,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:23:06,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-11-08 10:23:06,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560415253] [2024-11-08 10:23:06,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:06,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:23:06,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:06,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:23:06,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:23:06,508 INFO L87 Difference]: Start difference. First operand 343 states and 482 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-08 10:23:06,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:06,551 INFO L93 Difference]: Finished difference Result 688 states and 971 transitions. [2024-11-08 10:23:06,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:23:06,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 52 [2024-11-08 10:23:06,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:06,554 INFO L225 Difference]: With dead ends: 688 [2024-11-08 10:23:06,554 INFO L226 Difference]: Without dead ends: 348 [2024-11-08 10:23:06,555 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 10:23:06,556 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 6 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:06,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 183 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:06,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2024-11-08 10:23:06,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 346. [2024-11-08 10:23:06,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 275 states have (on average 1.269090909090909) internal successors, (349), 286 states have internal predecessors, (349), 45 states have call successors, (45), 14 states have call predecessors, (45), 25 states have return successors, (92), 45 states have call predecessors, (92), 44 states have call successors, (92) [2024-11-08 10:23:06,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 486 transitions. [2024-11-08 10:23:06,578 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 486 transitions. Word has length 52 [2024-11-08 10:23:06,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:06,578 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 486 transitions. [2024-11-08 10:23:06,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-08 10:23:06,578 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 486 transitions. [2024-11-08 10:23:06,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-08 10:23:06,579 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:06,580 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:06,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-08 10:23:06,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-08 10:23:06,780 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:06,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:06,781 INFO L85 PathProgramCache]: Analyzing trace with hash 388201992, now seen corresponding path program 1 times [2024-11-08 10:23:06,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:06,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760243854] [2024-11-08 10:23:06,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:06,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:06,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:06,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:23:06,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:06,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:23:06,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:06,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 10:23:06,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:06,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 10:23:06,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:06,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 10:23:06,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:06,908 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 10:23:06,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:06,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760243854] [2024-11-08 10:23:06,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760243854] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:06,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:06,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 10:23:06,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684494996] [2024-11-08 10:23:06,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:06,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 10:23:06,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:06,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 10:23:06,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-08 10:23:06,910 INFO L87 Difference]: Start difference. First operand 346 states and 486 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-08 10:23:06,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:06,973 INFO L93 Difference]: Finished difference Result 368 states and 507 transitions. [2024-11-08 10:23:06,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 10:23:06,973 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 53 [2024-11-08 10:23:06,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:06,975 INFO L225 Difference]: With dead ends: 368 [2024-11-08 10:23:06,975 INFO L226 Difference]: Without dead ends: 312 [2024-11-08 10:23:06,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-08 10:23:06,976 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 10 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:06,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 732 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:06,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-11-08 10:23:06,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 307. [2024-11-08 10:23:06,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 243 states have (on average 1.2592592592592593) internal successors, (306), 253 states have internal predecessors, (306), 40 states have call successors, (40), 13 states have call predecessors, (40), 23 states have return successors, (83), 40 states have call predecessors, (83), 39 states have call successors, (83) [2024-11-08 10:23:07,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 429 transitions. [2024-11-08 10:23:07,012 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 429 transitions. Word has length 53 [2024-11-08 10:23:07,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:07,013 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 429 transitions. [2024-11-08 10:23:07,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-08 10:23:07,013 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 429 transitions. [2024-11-08 10:23:07,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-08 10:23:07,015 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:07,015 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:07,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 10:23:07,015 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:07,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:07,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1758994133, now seen corresponding path program 1 times [2024-11-08 10:23:07,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:07,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349484351] [2024-11-08 10:23:07,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:07,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:07,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:07,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:23:07,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:07,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:23:07,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:07,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-08 10:23:07,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:07,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 10:23:07,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:07,049 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 10:23:07,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:07,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349484351] [2024-11-08 10:23:07,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349484351] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:23:07,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044881480] [2024-11-08 10:23:07,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:07,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:23:07,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:23:07,051 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:23:07,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-08 10:23:07,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:07,103 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 10:23:07,104 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:23:07,114 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-08 10:23:07,114 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:23:07,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1044881480] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:07,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:23:07,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2024-11-08 10:23:07,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421434381] [2024-11-08 10:23:07,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:07,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 10:23:07,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:07,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 10:23:07,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 10:23:07,115 INFO L87 Difference]: Start difference. First operand 307 states and 429 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-08 10:23:07,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:07,152 INFO L93 Difference]: Finished difference Result 617 states and 866 transitions. [2024-11-08 10:23:07,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 10:23:07,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 53 [2024-11-08 10:23:07,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:07,154 INFO L225 Difference]: With dead ends: 617 [2024-11-08 10:23:07,154 INFO L226 Difference]: Without dead ends: 313 [2024-11-08 10:23:07,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 62 SyntacticMatches, 1 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 10:23:07,157 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 5 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:07,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 184 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 10:23:07,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-11-08 10:23:07,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 309. [2024-11-08 10:23:07,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 245 states have (on average 1.2571428571428571) internal successors, (308), 255 states have internal predecessors, (308), 40 states have call successors, (40), 13 states have call predecessors, (40), 23 states have return successors, (83), 40 states have call predecessors, (83), 39 states have call successors, (83) [2024-11-08 10:23:07,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 431 transitions. [2024-11-08 10:23:07,174 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 431 transitions. Word has length 53 [2024-11-08 10:23:07,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:07,174 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 431 transitions. [2024-11-08 10:23:07,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-08 10:23:07,175 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 431 transitions. [2024-11-08 10:23:07,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-08 10:23:07,178 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:07,178 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:07,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-08 10:23:07,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-08 10:23:07,379 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:07,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:07,379 INFO L85 PathProgramCache]: Analyzing trace with hash 418107322, now seen corresponding path program 1 times [2024-11-08 10:23:07,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:07,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813089923] [2024-11-08 10:23:07,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:07,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:07,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:07,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:23:07,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:07,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:23:07,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:07,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 10:23:07,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:07,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 10:23:07,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:07,759 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 10:23:07,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:07,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813089923] [2024-11-08 10:23:07,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813089923] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:23:07,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791382553] [2024-11-08 10:23:07,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:07,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:23:07,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:23:07,762 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:23:07,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-08 10:23:07,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:07,847 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-08 10:23:07,848 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:23:07,953 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-08 10:23:07,953 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:23:07,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791382553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:07,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 10:23:07,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [15] total 20 [2024-11-08 10:23:07,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79932133] [2024-11-08 10:23:07,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:07,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 10:23:07,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:07,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 10:23:07,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2024-11-08 10:23:07,956 INFO L87 Difference]: Start difference. First operand 309 states and 431 transitions. Second operand has 9 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-08 10:23:08,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:08,075 INFO L93 Difference]: Finished difference Result 498 states and 692 transitions. [2024-11-08 10:23:08,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 10:23:08,075 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 54 [2024-11-08 10:23:08,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:08,078 INFO L225 Difference]: With dead ends: 498 [2024-11-08 10:23:08,079 INFO L226 Difference]: Without dead ends: 320 [2024-11-08 10:23:08,080 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=415, Unknown=0, NotChecked=0, Total=462 [2024-11-08 10:23:08,080 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 59 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:08,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 820 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:23:08,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-11-08 10:23:08,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 309. [2024-11-08 10:23:08,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 245 states have (on average 1.2489795918367348) internal successors, (306), 255 states have internal predecessors, (306), 40 states have call successors, (40), 13 states have call predecessors, (40), 23 states have return successors, (83), 40 states have call predecessors, (83), 39 states have call successors, (83) [2024-11-08 10:23:08,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 429 transitions. [2024-11-08 10:23:08,110 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 429 transitions. Word has length 54 [2024-11-08 10:23:08,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:08,111 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 429 transitions. [2024-11-08 10:23:08,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-08 10:23:08,111 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 429 transitions. [2024-11-08 10:23:08,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-08 10:23:08,114 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:08,114 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:08,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-08 10:23:08,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-08 10:23:08,315 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:08,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:08,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1317589488, now seen corresponding path program 1 times [2024-11-08 10:23:08,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:08,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666098302] [2024-11-08 10:23:08,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:08,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:08,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:08,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:23:08,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:08,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:23:08,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:08,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 10:23:08,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:08,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 10:23:08,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:08,433 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 10:23:08,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:08,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666098302] [2024-11-08 10:23:08,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666098302] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:23:08,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848189616] [2024-11-08 10:23:08,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:08,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:23:08,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:23:08,435 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:23:08,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-08 10:23:08,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:08,493 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-08 10:23:08,495 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:23:08,521 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-08 10:23:08,521 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:23:08,681 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 10:23:08,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848189616] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:23:08,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 10:23:08,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 15 [2024-11-08 10:23:08,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230940171] [2024-11-08 10:23:08,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 10:23:08,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 10:23:08,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:08,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 10:23:08,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-11-08 10:23:08,683 INFO L87 Difference]: Start difference. First operand 309 states and 429 transitions. Second operand has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 11 states have internal predecessors, (47), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-08 10:23:08,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:08,854 INFO L93 Difference]: Finished difference Result 448 states and 610 transitions. [2024-11-08 10:23:08,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 10:23:08,854 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 11 states have internal predecessors, (47), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) Word has length 54 [2024-11-08 10:23:08,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:08,857 INFO L225 Difference]: With dead ends: 448 [2024-11-08 10:23:08,857 INFO L226 Difference]: Without dead ends: 367 [2024-11-08 10:23:08,857 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2024-11-08 10:23:08,858 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 93 mSDsluCounter, 1158 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 1266 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:08,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 1266 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:23:08,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2024-11-08 10:23:08,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 347. [2024-11-08 10:23:08,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 277 states have (on average 1.259927797833935) internal successors, (349), 289 states have internal predecessors, (349), 43 states have call successors, (43), 14 states have call predecessors, (43), 26 states have return successors, (84), 43 states have call predecessors, (84), 42 states have call successors, (84) [2024-11-08 10:23:08,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 476 transitions. [2024-11-08 10:23:08,889 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 476 transitions. Word has length 54 [2024-11-08 10:23:08,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:08,889 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 476 transitions. [2024-11-08 10:23:08,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 11 states have internal predecessors, (47), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-08 10:23:08,890 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 476 transitions. [2024-11-08 10:23:08,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-08 10:23:08,891 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:08,891 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:08,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-08 10:23:09,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-08 10:23:09,092 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:09,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:09,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1956309454, now seen corresponding path program 2 times [2024-11-08 10:23:09,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:09,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897596438] [2024-11-08 10:23:09,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:09,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:09,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:09,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:23:09,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:09,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:23:09,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:09,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 10:23:09,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:09,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 10:23:09,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:09,258 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 10:23:09,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:09,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897596438] [2024-11-08 10:23:09,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897596438] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:23:09,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516564660] [2024-11-08 10:23:09,258 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 10:23:09,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:23:09,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:23:09,260 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:23:09,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-08 10:23:09,345 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 10:23:09,345 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 10:23:09,348 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-08 10:23:09,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:23:09,376 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-08 10:23:09,377 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:23:09,500 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-08 10:23:09,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516564660] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:23:09,500 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 10:23:09,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2024-11-08 10:23:09,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625237959] [2024-11-08 10:23:09,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 10:23:09,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 10:23:09,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:09,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 10:23:09,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2024-11-08 10:23:09,502 INFO L87 Difference]: Start difference. First operand 347 states and 476 transitions. Second operand has 16 states, 16 states have (on average 3.0) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-08 10:23:09,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:09,690 INFO L93 Difference]: Finished difference Result 580 states and 799 transitions. [2024-11-08 10:23:09,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 10:23:09,691 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) Word has length 54 [2024-11-08 10:23:09,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:09,693 INFO L225 Difference]: With dead ends: 580 [2024-11-08 10:23:09,693 INFO L226 Difference]: Without dead ends: 394 [2024-11-08 10:23:09,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2024-11-08 10:23:09,694 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 133 mSDsluCounter, 1133 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 1251 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:09,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 1251 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:23:09,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-08 10:23:09,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 347. [2024-11-08 10:23:09,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 277 states have (on average 1.2527075812274369) internal successors, (347), 289 states have internal predecessors, (347), 43 states have call successors, (43), 14 states have call predecessors, (43), 26 states have return successors, (84), 43 states have call predecessors, (84), 42 states have call successors, (84) [2024-11-08 10:23:09,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 474 transitions. [2024-11-08 10:23:09,716 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 474 transitions. Word has length 54 [2024-11-08 10:23:09,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:09,716 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 474 transitions. [2024-11-08 10:23:09,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.0) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-08 10:23:09,716 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 474 transitions. [2024-11-08 10:23:09,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-08 10:23:09,717 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:09,717 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:09,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-08 10:23:09,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-08 10:23:09,919 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:09,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:09,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1591446259, now seen corresponding path program 1 times [2024-11-08 10:23:09,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:09,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603394569] [2024-11-08 10:23:09,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:09,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:09,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:10,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:23:10,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:10,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:23:10,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:10,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 10:23:10,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:10,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 10:23:10,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:10,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 10:23:10,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:10,109 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 10:23:10,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:10,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603394569] [2024-11-08 10:23:10,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603394569] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:23:10,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863691892] [2024-11-08 10:23:10,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:10,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:23:10,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:23:10,112 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:23:10,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-08 10:23:10,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:10,202 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-08 10:23:10,203 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:23:10,236 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 10:23:10,237 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:23:10,563 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 10:23:10,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863691892] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:23:10,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 10:23:10,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2024-11-08 10:23:10,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279964406] [2024-11-08 10:23:10,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 10:23:10,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-08 10:23:10,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:10,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-08 10:23:10,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=540, Unknown=0, NotChecked=0, Total=600 [2024-11-08 10:23:10,565 INFO L87 Difference]: Start difference. First operand 347 states and 474 transitions. Second operand has 25 states, 23 states have (on average 2.347826086956522) internal successors, (54), 21 states have internal predecessors, (54), 4 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-08 10:23:11,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:11,199 INFO L93 Difference]: Finished difference Result 413 states and 580 transitions. [2024-11-08 10:23:11,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-08 10:23:11,200 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.347826086956522) internal successors, (54), 21 states have internal predecessors, (54), 4 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 55 [2024-11-08 10:23:11,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:11,203 INFO L225 Difference]: With dead ends: 413 [2024-11-08 10:23:11,203 INFO L226 Difference]: Without dead ends: 381 [2024-11-08 10:23:11,204 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=137, Invalid=1269, Unknown=0, NotChecked=0, Total=1406 [2024-11-08 10:23:11,204 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 165 mSDsluCounter, 2137 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 2269 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:11,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 2269 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 10:23:11,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2024-11-08 10:23:11,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 333. [2024-11-08 10:23:11,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 267 states have (on average 1.2621722846441947) internal successors, (337), 278 states have internal predecessors, (337), 41 states have call successors, (41), 12 states have call predecessors, (41), 24 states have return successors, (80), 42 states have call predecessors, (80), 40 states have call successors, (80) [2024-11-08 10:23:11,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 458 transitions. [2024-11-08 10:23:11,229 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 458 transitions. Word has length 55 [2024-11-08 10:23:11,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:11,229 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 458 transitions. [2024-11-08 10:23:11,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.347826086956522) internal successors, (54), 21 states have internal predecessors, (54), 4 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-08 10:23:11,229 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 458 transitions. [2024-11-08 10:23:11,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-08 10:23:11,230 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:11,230 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:11,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-08 10:23:11,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:23:11,435 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:11,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:11,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1131087777, now seen corresponding path program 2 times [2024-11-08 10:23:11,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:11,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23059807] [2024-11-08 10:23:11,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:11,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:11,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:11,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 10:23:11,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:11,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 10:23:11,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:11,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 10:23:11,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:11,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 10:23:11,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:11,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 10:23:11,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:11,622 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 10:23:11,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 10:23:11,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23059807] [2024-11-08 10:23:11,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23059807] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 10:23:11,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009631526] [2024-11-08 10:23:11,623 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 10:23:11,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:23:11,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:23:11,625 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 10:23:11,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-08 10:23:11,695 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 10:23:11,695 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 10:23:11,697 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-08 10:23:11,699 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:23:12,483 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-08 10:23:12,483 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:23:13,055 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-08 10:23:13,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2009631526] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:23:13,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 10:23:13,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18, 13] total 36 [2024-11-08 10:23:13,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186601513] [2024-11-08 10:23:13,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 10:23:13,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-08 10:23:13,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 10:23:13,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-08 10:23:13,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1167, Unknown=0, NotChecked=0, Total=1260 [2024-11-08 10:23:13,058 INFO L87 Difference]: Start difference. First operand 333 states and 458 transitions. Second operand has 36 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 29 states have internal predecessors, (65), 6 states have call successors, (10), 2 states have call predecessors, (10), 7 states have return successors, (11), 9 states have call predecessors, (11), 5 states have call successors, (11) [2024-11-08 10:23:14,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:14,284 INFO L93 Difference]: Finished difference Result 451 states and 683 transitions. [2024-11-08 10:23:14,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-08 10:23:14,284 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 29 states have internal predecessors, (65), 6 states have call successors, (10), 2 states have call predecessors, (10), 7 states have return successors, (11), 9 states have call predecessors, (11), 5 states have call successors, (11) Word has length 55 [2024-11-08 10:23:14,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:14,287 INFO L225 Difference]: With dead ends: 451 [2024-11-08 10:23:14,287 INFO L226 Difference]: Without dead ends: 411 [2024-11-08 10:23:14,288 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=185, Invalid=2167, Unknown=0, NotChecked=0, Total=2352 [2024-11-08 10:23:14,288 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 172 mSDsluCounter, 3128 mSDsCounter, 0 mSdLazyCounter, 1138 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 3266 SdHoareTripleChecker+Invalid, 1160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:14,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 3266 Invalid, 1160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1138 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 10:23:14,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2024-11-08 10:23:14,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 325. [2024-11-08 10:23:14,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 260 states have (on average 1.2692307692307692) internal successors, (330), 273 states have internal predecessors, (330), 40 states have call successors, (40), 10 states have call predecessors, (40), 24 states have return successors, (79), 41 states have call predecessors, (79), 39 states have call successors, (79) [2024-11-08 10:23:14,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 449 transitions. [2024-11-08 10:23:14,332 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 449 transitions. Word has length 55 [2024-11-08 10:23:14,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:14,333 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 449 transitions. [2024-11-08 10:23:14,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 29 states have internal predecessors, (65), 6 states have call successors, (10), 2 states have call predecessors, (10), 7 states have return successors, (11), 9 states have call predecessors, (11), 5 states have call successors, (11) [2024-11-08 10:23:14,333 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 449 transitions. [2024-11-08 10:23:14,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-08 10:23:14,334 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:14,334 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:14,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-08 10:23:14,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 10:23:14,538 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:14,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:14,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1641792537, now seen corresponding path program 1 times [2024-11-08 10:23:14,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 10:23:14,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40178230] [2024-11-08 10:23:14,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:14,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 10:23:14,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 10:23:14,569 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 10:23:14,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 10:23:14,632 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 10:23:14,632 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 10:23:14,634 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 10:23:14,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-08 10:23:14,639 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:14,677 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 10:23:14,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 10:23:14 BoogieIcfgContainer [2024-11-08 10:23:14,680 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 10:23:14,681 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 10:23:14,681 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 10:23:14,681 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 10:23:14,681 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:22:53" (3/4) ... [2024-11-08 10:23:14,684 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 10:23:14,685 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 10:23:14,685 INFO L158 Benchmark]: Toolchain (without parser) took 22048.91ms. Allocated memory was 155.2MB in the beginning and 308.3MB in the end (delta: 153.1MB). Free memory was 85.2MB in the beginning and 127.7MB in the end (delta: -42.4MB). Peak memory consumption was 112.4MB. Max. memory is 16.1GB. [2024-11-08 10:23:14,685 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 155.2MB. Free memory was 110.0MB in the beginning and 109.8MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 10:23:14,686 INFO L158 Benchmark]: CACSL2BoogieTranslator took 310.81ms. Allocated memory is still 155.2MB. Free memory was 85.1MB in the beginning and 124.2MB in the end (delta: -39.1MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. [2024-11-08 10:23:14,686 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.84ms. Allocated memory is still 155.2MB. Free memory was 124.2MB in the beginning and 122.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 10:23:14,686 INFO L158 Benchmark]: Boogie Preprocessor took 41.81ms. Allocated memory is still 155.2MB. Free memory was 122.6MB in the beginning and 120.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 10:23:14,686 INFO L158 Benchmark]: RCFGBuilder took 513.59ms. Allocated memory is still 155.2MB. Free memory was 120.0MB in the beginning and 100.1MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-08 10:23:14,687 INFO L158 Benchmark]: TraceAbstraction took 21144.29ms. Allocated memory was 155.2MB in the beginning and 308.3MB in the end (delta: 153.1MB). Free memory was 99.6MB in the beginning and 127.7MB in the end (delta: -28.1MB). Peak memory consumption was 125.0MB. Max. memory is 16.1GB. [2024-11-08 10:23:14,687 INFO L158 Benchmark]: Witness Printer took 4.10ms. Allocated memory is still 308.3MB. Free memory is still 127.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 10:23:14,688 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.19ms. Allocated memory is still 155.2MB. Free memory was 110.0MB in the beginning and 109.8MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 310.81ms. Allocated memory is still 155.2MB. Free memory was 85.1MB in the beginning and 124.2MB in the end (delta: -39.1MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.84ms. Allocated memory is still 155.2MB. Free memory was 124.2MB in the beginning and 122.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.81ms. Allocated memory is still 155.2MB. Free memory was 122.6MB in the beginning and 120.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 513.59ms. Allocated memory is still 155.2MB. Free memory was 120.0MB in the beginning and 100.1MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 21144.29ms. Allocated memory was 155.2MB in the beginning and 308.3MB in the end (delta: 153.1MB). Free memory was 99.6MB in the beginning and 127.7MB in the end (delta: -28.1MB). Peak memory consumption was 125.0MB. Max. memory is 16.1GB. * Witness Printer took 4.10ms. Allocated memory is still 308.3MB. Free memory is still 127.7MB. 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: 17]: 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 bitwiseOr at line 110, overapproximation of bitwiseAnd at line 76. Possible FailurePath: [L226] unsigned int a ; [L227] unsigned int ma = __VERIFIER_nondet_uint(); [L228] signed char ea = __VERIFIER_nondet_char(); [L229] unsigned int b ; [L230] unsigned int mb = __VERIFIER_nondet_uint(); [L231] signed char eb = __VERIFIER_nondet_char(); [L232] unsigned int r_add1 ; [L233] unsigned int r_add2 ; [L234] unsigned int zero ; [L235] int tmp ; [L236] int tmp___0 ; [L237] int __retres14 ; VAL [ea=-127, eb=127] [L241] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, e=0] [L241] RET, EXPR base2flt(0, 0) VAL [ea=-127, eb=127] [L241] zero = base2flt(0, 0) [L242] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=-127, \old(m)=4311744512] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=-127, \old(m)=4311744512, e=-127, m=4311744512] [L29] COND FALSE !(! m) VAL [\old(e)=-127, \old(m)=4311744512, e=-127, m=4311744512] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=-127, \old(m)=4311744512, e=-127, m=4311744512] [L57] COND TRUE 1 VAL [\old(e)=-127, \old(m)=4311744512, e=-127, m=4311744512] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=-127, \old(m)=4311744512, e=-127, m=4311744512] [L76] EXPR m & ~ (1U << 24U) VAL [\old(e)=-127, \old(m)=4311744512, e=-127] [L76] m = m & ~ (1U << 24U) [L77] EXPR m | ((unsigned int )(e + 128) << 24U) VAL [\old(e)=-127, \old(m)=4311744512] [L77] res = m | ((unsigned int )(e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=-127, \old(m)=4311744512, __retres4=16777216] [L80] return (__retres4); VAL [\old(e)=-127, \old(m)=4311744512, \result=16777216] [L242] RET, EXPR base2flt(ma, ea) VAL [ea=-127, eb=127, ma=4311744512] [L242] a = base2flt(ma, ea) [L243] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=127, \old(m)=33554432] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L29] COND FALSE !(! m) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L57] COND TRUE 1 VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L59] COND TRUE m >= 1U << 25U VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L64] COND TRUE e >= 127 [L65] __retres4 = 4294967295U VAL [\old(e)=127, \old(m)=33554432, __retres4=4294967295, m=33554432] [L80] return (__retres4); VAL [\old(e)=127, \old(m)=33554432, \result=4294967295, m=33554432] [L243] RET, EXPR base2flt(mb, eb) VAL [a=16777216, ea=-127, eb=127, ma=4311744512, mb=33554432] [L243] b = base2flt(mb, eb) [L244] CALL addflt(a, b) VAL [\old(a)=16777216, \old(b)=4294967295] [L84] unsigned int res ; [L85] unsigned int ma ; [L86] unsigned int mb ; [L87] unsigned int delta ; [L88] int ea ; [L89] int eb ; [L90] unsigned int tmp ; [L91] unsigned int __retres10 ; VAL [\old(a)=16777216, \old(b)=4294967295, a=16777216, b=4294967295] [L94] COND TRUE a < b [L95] tmp = a [L96] a = b [L97] b = tmp VAL [\old(a)=16777216, \old(b)=4294967295, a=4294967295, b=16777216] [L101] COND FALSE !(! b) [L108] ma = a & ((1U << 24U) - 1U) [L109] ea = (int )(a >> 24U) - 128 VAL [\old(a)=16777216, \old(b)=4294967295, a=4294967295, b=16777216, ea=127, ma=16777215] [L110] EXPR ma | (1U << 24U) VAL [\old(a)=16777216, \old(b)=4294967295, a=4294967295, b=16777216, ea=127] [L110] ma = ma | (1U << 24U) [L111] mb = b & ((1U << 24U) - 1U) [L112] eb = (int )(b >> 24U) - 128 VAL [\old(a)=16777216, \old(b)=4294967295, a=4294967295, ea=127, eb=-127, ma=16777216, mb=0] [L113] EXPR mb | (1U << 24U) VAL [\old(a)=16777216, \old(b)=4294967295, a=4294967295, ea=127, eb=-127, ma=16777216] [L113] mb = mb | (1U << 24U) [L114] CALL __VERIFIER_assert(ea >= eb) VAL [\old(cond)=1] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L114] RET __VERIFIER_assert(ea >= eb) VAL [\old(a)=16777216, \old(b)=4294967295, a=4294967295, ea=127, eb=-127, ma=16777216, mb=16777216] [L115] delta = ea - eb VAL [\old(a)=16777216, \old(b)=4294967295, a=4294967295, delta=254, ea=127, ma=16777216, mb=16777216] [L116] CALL __VERIFIER_assert(delta < sizeof(mb) * 8) VAL [\old(cond)=0] [L16] COND TRUE !(cond) VAL [\old(cond)=0] [L17] reach_error() VAL [\old(cond)=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 78 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.1s, OverallIterations: 21, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2002 SdHoareTripleChecker+Valid, 4.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1844 mSDsluCounter, 29180 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26746 mSDsCounter, 296 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6151 IncrementalHoareTripleChecker+Invalid, 6447 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 296 mSolverCounterUnsat, 2434 mSDtfsCounter, 6151 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1612 GetRequests, 1193 SyntacticMatches, 5 SemanticMatches, 414 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2056 ImplicationChecksByTransitivity, 6.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=347occurred in iteration=17, InterpolantAutomatonStates: 313, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 20 MinimizatonAttempts, 849 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 8.4s InterpolantComputationTime, 1710 NumberOfCodeBlocks, 1692 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 2053 ConstructedInterpolants, 1 QuantifiedInterpolants, 4816 SizeOfPredicates, 21 NumberOfNonLiveVariables, 2085 ConjunctsInSsa, 299 ConjunctsInUnsatCore, 43 InterpolantComputations, 11 PerfectInterpolantSequences, 708/848 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 10:23:14,721 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/bitvector/soft_float_4-3a.c.cil.c -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 c7e459611ed6ff9d4c49aa04980ca7f1d5aaaf97e8fc0116c264955df4ed453a --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 10:23:16,805 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 10:23:16,885 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 10:23:16,891 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 10:23:16,891 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 10:23:16,924 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 10:23:16,924 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 10:23:16,925 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 10:23:16,925 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 10:23:16,926 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 10:23:16,926 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 10:23:16,926 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 10:23:16,927 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 10:23:16,927 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 10:23:16,930 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 10:23:16,931 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 10:23:16,932 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 10:23:16,932 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 10:23:16,932 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 10:23:16,932 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 10:23:16,933 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 10:23:16,936 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 10:23:16,937 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 10:23:16,937 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 10:23:16,937 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 10:23:16,937 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 10:23:16,938 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 10:23:16,938 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 10:23:16,938 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 10:23:16,938 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 10:23:16,939 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 10:23:16,939 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 10:23:16,939 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 10:23:16,939 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 10:23:16,939 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:23:16,940 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 10:23:16,941 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 10:23:16,942 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 10:23:16,942 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 10:23:16,942 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 10:23:16,942 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 10:23:16,943 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 10:23:16,943 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 10:23:16,943 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 10:23:16,943 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 -> c7e459611ed6ff9d4c49aa04980ca7f1d5aaaf97e8fc0116c264955df4ed453a [2024-11-08 10:23:17,255 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 10:23:17,276 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 10:23:17,278 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 10:23:17,279 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 10:23:17,281 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 10:23:17,282 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2024-11-08 10:23:18,722 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 10:23:18,930 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 10:23:18,930 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2024-11-08 10:23:18,943 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd5e673a8/461c35fa12fd4f5b8688bff33bafc9c7/FLAG3a688df45 [2024-11-08 10:23:18,959 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd5e673a8/461c35fa12fd4f5b8688bff33bafc9c7 [2024-11-08 10:23:18,961 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 10:23:18,962 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 10:23:18,966 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 10:23:18,966 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 10:23:18,971 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 10:23:18,972 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:23:18" (1/1) ... [2024-11-08 10:23:18,977 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@580554bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:23:18, skipping insertion in model container [2024-11-08 10:23:18,977 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:23:18" (1/1) ... [2024-11-08 10:23:19,008 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 10:23:19,187 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/bitvector/soft_float_4-3a.c.cil.c[730,743] [2024-11-08 10:23:19,248 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:23:19,262 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 10:23:19,274 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/bitvector/soft_float_4-3a.c.cil.c[730,743] [2024-11-08 10:23:19,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 10:23:19,327 INFO L204 MainTranslator]: Completed translation [2024-11-08 10:23:19,328 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:23:19 WrapperNode [2024-11-08 10:23:19,328 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 10:23:19,329 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 10:23:19,329 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 10:23:19,329 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 10:23:19,335 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:23:19" (1/1) ... [2024-11-08 10:23:19,345 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:23:19" (1/1) ... [2024-11-08 10:23:19,361 INFO L138 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2024-11-08 10:23:19,362 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 10:23:19,363 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 10:23:19,363 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 10:23:19,364 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 10:23:19,373 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:23:19" (1/1) ... [2024-11-08 10:23:19,374 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:23:19" (1/1) ... [2024-11-08 10:23:19,379 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:23:19" (1/1) ... [2024-11-08 10:23:19,398 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 10:23:19,399 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:23:19" (1/1) ... [2024-11-08 10:23:19,399 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:23:19" (1/1) ... [2024-11-08 10:23:19,404 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:23:19" (1/1) ... [2024-11-08 10:23:19,407 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:23:19" (1/1) ... [2024-11-08 10:23:19,408 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:23:19" (1/1) ... [2024-11-08 10:23:19,409 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:23:19" (1/1) ... [2024-11-08 10:23:19,411 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 10:23:19,412 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 10:23:19,412 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 10:23:19,412 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 10:23:19,413 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:23:19" (1/1) ... [2024-11-08 10:23:19,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 10:23:19,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 10:23:19,445 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 10:23:19,447 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 10:23:19,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 10:23:19,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 10:23:19,492 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2024-11-08 10:23:19,493 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2024-11-08 10:23:19,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 10:23:19,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 10:23:19,493 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2024-11-08 10:23:19,493 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2024-11-08 10:23:19,493 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-08 10:23:19,493 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-08 10:23:19,582 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 10:23:19,584 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 10:23:19,830 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-11-08 10:23:19,830 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 10:23:19,844 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 10:23:19,845 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-08 10:23:19,845 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:23:19 BoogieIcfgContainer [2024-11-08 10:23:19,846 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 10:23:19,848 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 10:23:19,848 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 10:23:19,851 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 10:23:19,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:23:18" (1/3) ... [2024-11-08 10:23:19,852 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62feed4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:23:19, skipping insertion in model container [2024-11-08 10:23:19,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:23:19" (2/3) ... [2024-11-08 10:23:19,853 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62feed4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:23:19, skipping insertion in model container [2024-11-08 10:23:19,853 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:23:19" (3/3) ... [2024-11-08 10:23:19,855 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_4-3a.c.cil.c [2024-11-08 10:23:19,871 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 10:23:19,871 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 10:23:19,933 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 10:23:19,939 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;@8804fbe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 10:23:19,940 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 10:23:19,945 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 40 states have (on average 1.475) internal successors, (59), 41 states have internal predecessors, (59), 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 10:23:19,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-08 10:23:19,952 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:19,953 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] [2024-11-08 10:23:19,954 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:19,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:19,975 INFO L85 PathProgramCache]: Analyzing trace with hash 173410466, now seen corresponding path program 1 times [2024-11-08 10:23:19,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 10:23:19,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1232397853] [2024-11-08 10:23:19,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:19,987 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 10:23:19,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 10:23:19,990 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 10:23:19,991 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 10:23:20,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:20,092 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 10:23:20,099 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:23:20,230 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 10:23:20,231 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:23:20,231 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 10:23:20,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1232397853] [2024-11-08 10:23:20,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1232397853] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:20,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:20,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 10:23:20,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774409646] [2024-11-08 10:23:20,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:20,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 10:23:20,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 10:23:20,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 10:23:20,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-08 10:23:20,264 INFO L87 Difference]: Start difference. First operand has 54 states, 40 states have (on average 1.475) internal successors, (59), 41 states have internal predecessors, (59), 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 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:23:20,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:20,385 INFO L93 Difference]: Finished difference Result 125 states and 190 transitions. [2024-11-08 10:23:20,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 10:23:20,388 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2024-11-08 10:23:20,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:20,397 INFO L225 Difference]: With dead ends: 125 [2024-11-08 10:23:20,398 INFO L226 Difference]: Without dead ends: 68 [2024-11-08 10:23:20,403 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-08 10:23:20,408 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 14 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:20,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 452 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:23:20,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-08 10:23:20,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 61. [2024-11-08 10:23:20,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 47 states have internal predecessors, (59), 10 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-08 10:23:20,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 81 transitions. [2024-11-08 10:23:20,459 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 81 transitions. Word has length 31 [2024-11-08 10:23:20,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:20,460 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 81 transitions. [2024-11-08 10:23:20,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:23:20,460 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 81 transitions. [2024-11-08 10:23:20,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-08 10:23:20,464 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:20,464 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:20,469 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 (2)] Ended with exit code 0 [2024-11-08 10:23:20,668 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 10:23:20,668 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:20,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:20,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1707598935, now seen corresponding path program 1 times [2024-11-08 10:23:20,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 10:23:20,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1419779432] [2024-11-08 10:23:20,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:20,670 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 10:23:20,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 10:23:20,769 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 10:23:20,770 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 10:23:20,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:20,831 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-08 10:23:20,836 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:23:20,931 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 10:23:20,932 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:23:20,996 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 10:23:20,996 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 10:23:20,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1419779432] [2024-11-08 10:23:20,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1419779432] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:23:20,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 10:23:20,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2024-11-08 10:23:20,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118774954] [2024-11-08 10:23:20,997 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 10:23:20,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 10:23:21,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 10:23:21,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 10:23:21,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-08 10:23:21,003 INFO L87 Difference]: Start difference. First operand 61 states and 81 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 10:23:21,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:21,117 INFO L93 Difference]: Finished difference Result 115 states and 153 transitions. [2024-11-08 10:23:21,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 10:23:21,118 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2024-11-08 10:23:21,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:21,120 INFO L225 Difference]: With dead ends: 115 [2024-11-08 10:23:21,120 INFO L226 Difference]: Without dead ends: 87 [2024-11-08 10:23:21,120 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-08 10:23:21,121 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 15 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:21,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 485 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:23:21,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-08 10:23:21,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 71. [2024-11-08 10:23:21,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 54 states have internal predecessors, (67), 12 states have call successors, (12), 5 states have call predecessors, (12), 6 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2024-11-08 10:23:21,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 94 transitions. [2024-11-08 10:23:21,136 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 94 transitions. Word has length 35 [2024-11-08 10:23:21,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:21,137 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 94 transitions. [2024-11-08 10:23:21,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 7 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 10:23:21,137 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 94 transitions. [2024-11-08 10:23:21,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 10:23:21,138 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:21,139 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:21,142 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 10:23:21,341 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 10:23:21,342 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:21,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:21,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1508244029, now seen corresponding path program 1 times [2024-11-08 10:23:21,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 10:23:21,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1138314351] [2024-11-08 10:23:21,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:21,344 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 10:23:21,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 10:23:21,347 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 10:23:21,348 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 10:23:21,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:21,407 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 10:23:21,409 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:23:21,475 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 10:23:21,477 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 10:23:21,529 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 10:23:21,530 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 10:23:21,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1138314351] [2024-11-08 10:23:21,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1138314351] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 10:23:21,531 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 10:23:21,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-11-08 10:23:21,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554008830] [2024-11-08 10:23:21,531 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 10:23:21,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 10:23:21,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 10:23:21,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 10:23:21,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-08 10:23:21,533 INFO L87 Difference]: Start difference. First operand 71 states and 94 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-08 10:23:21,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:21,604 INFO L93 Difference]: Finished difference Result 110 states and 146 transitions. [2024-11-08 10:23:21,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 10:23:21,605 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 39 [2024-11-08 10:23:21,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:21,607 INFO L225 Difference]: With dead ends: 110 [2024-11-08 10:23:21,607 INFO L226 Difference]: Without dead ends: 86 [2024-11-08 10:23:21,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-08 10:23:21,608 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 12 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:21,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 453 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:23:21,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-08 10:23:21,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 81. [2024-11-08 10:23:21,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 59 states have (on average 1.2542372881355932) internal successors, (74), 61 states have internal predecessors, (74), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2024-11-08 10:23:21,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 105 transitions. [2024-11-08 10:23:21,620 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 105 transitions. Word has length 39 [2024-11-08 10:23:21,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:21,620 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 105 transitions. [2024-11-08 10:23:21,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 6 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-08 10:23:21,621 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 105 transitions. [2024-11-08 10:23:21,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 10:23:21,622 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:21,622 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:21,627 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 10:23:21,826 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 10:23:21,826 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:21,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:21,827 INFO L85 PathProgramCache]: Analyzing trace with hash -54729342, now seen corresponding path program 2 times [2024-11-08 10:23:21,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 10:23:21,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [937021436] [2024-11-08 10:23:21,827 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 10:23:21,828 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 10:23:21,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 10:23:21,831 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 10:23:21,835 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 10:23:21,872 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-08 10:23:21,872 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 10:23:21,874 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-08 10:23:21,876 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:23:22,001 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-08 10:23:22,001 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:23:22,002 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 10:23:22,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [937021436] [2024-11-08 10:23:22,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [937021436] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:22,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:22,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 10:23:22,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681539723] [2024-11-08 10:23:22,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:22,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 10:23:22,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 10:23:22,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 10:23:22,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 10:23:22,004 INFO L87 Difference]: Start difference. First operand 81 states and 105 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:23:22,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:22,103 INFO L93 Difference]: Finished difference Result 91 states and 116 transitions. [2024-11-08 10:23:22,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 10:23:22,104 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2024-11-08 10:23:22,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:22,106 INFO L225 Difference]: With dead ends: 91 [2024-11-08 10:23:22,106 INFO L226 Difference]: Without dead ends: 89 [2024-11-08 10:23:22,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 10:23:22,107 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 3 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:22,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 313 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:23:22,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-08 10:23:22,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2024-11-08 10:23:22,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 63 states have (on average 1.253968253968254) internal successors, (79), 66 states have internal predecessors, (79), 15 states have call successors, (15), 7 states have call predecessors, (15), 8 states have return successors, (18), 13 states have call predecessors, (18), 14 states have call successors, (18) [2024-11-08 10:23:22,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 112 transitions. [2024-11-08 10:23:22,126 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 112 transitions. Word has length 39 [2024-11-08 10:23:22,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:22,128 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 112 transitions. [2024-11-08 10:23:22,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:23:22,129 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 112 transitions. [2024-11-08 10:23:22,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 10:23:22,130 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:22,130 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:22,133 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 10:23:22,332 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 10:23:22,332 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:22,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:22,338 INFO L85 PathProgramCache]: Analyzing trace with hash 2528960, now seen corresponding path program 1 times [2024-11-08 10:23:22,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 10:23:22,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [216667777] [2024-11-08 10:23:22,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:22,340 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 10:23:22,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 10:23:22,375 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 10:23:22,380 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 10:23:22,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:22,422 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 10:23:22,425 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:23:22,517 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-08 10:23:22,517 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:23:22,517 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 10:23:22,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [216667777] [2024-11-08 10:23:22,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [216667777] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:22,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:22,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 10:23:22,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847557999] [2024-11-08 10:23:22,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:22,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 10:23:22,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 10:23:22,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 10:23:22,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 10:23:22,520 INFO L87 Difference]: Start difference. First operand 87 states and 112 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:23:22,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:22,606 INFO L93 Difference]: Finished difference Result 93 states and 117 transitions. [2024-11-08 10:23:22,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 10:23:22,607 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2024-11-08 10:23:22,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:22,608 INFO L225 Difference]: With dead ends: 93 [2024-11-08 10:23:22,608 INFO L226 Difference]: Without dead ends: 91 [2024-11-08 10:23:22,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 10:23:22,609 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 3 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:22,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 308 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:23:22,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-08 10:23:22,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 85. [2024-11-08 10:23:22,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 62 states have (on average 1.2419354838709677) internal successors, (77), 64 states have internal predecessors, (77), 14 states have call successors, (14), 7 states have call predecessors, (14), 8 states have return successors, (17), 13 states have call predecessors, (17), 13 states have call successors, (17) [2024-11-08 10:23:22,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 108 transitions. [2024-11-08 10:23:22,623 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 108 transitions. Word has length 39 [2024-11-08 10:23:22,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:22,623 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 108 transitions. [2024-11-08 10:23:22,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 10:23:22,624 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 108 transitions. [2024-11-08 10:23:22,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-08 10:23:22,625 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:22,629 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:22,635 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 (6)] Forceful destruction successful, exit code 0 [2024-11-08 10:23:22,830 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 10:23:22,830 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:22,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:22,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1837968146, now seen corresponding path program 1 times [2024-11-08 10:23:22,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 10:23:22,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [765974609] [2024-11-08 10:23:22,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:22,832 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 10:23:22,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 10:23:22,835 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 10:23:22,836 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 10:23:22,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:22,887 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-08 10:23:22,889 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:23:22,987 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-08 10:23:22,988 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:23:22,989 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 10:23:22,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [765974609] [2024-11-08 10:23:22,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [765974609] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:22,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:22,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 10:23:22,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259961230] [2024-11-08 10:23:22,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:22,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 10:23:22,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 10:23:22,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 10:23:22,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-08 10:23:22,991 INFO L87 Difference]: Start difference. First operand 85 states and 108 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 9 states have internal predecessors, (28), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 10:23:23,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:23,224 INFO L93 Difference]: Finished difference Result 124 states and 163 transitions. [2024-11-08 10:23:23,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 10:23:23,225 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 9 states have internal predecessors, (28), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 44 [2024-11-08 10:23:23,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:23,226 INFO L225 Difference]: With dead ends: 124 [2024-11-08 10:23:23,226 INFO L226 Difference]: Without dead ends: 117 [2024-11-08 10:23:23,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-08 10:23:23,227 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 22 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:23,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 579 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 10:23:23,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-08 10:23:23,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 100. [2024-11-08 10:23:23,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 72 states have (on average 1.2361111111111112) internal successors, (89), 74 states have internal predecessors, (89), 18 states have call successors, (18), 7 states have call predecessors, (18), 9 states have return successors, (24), 18 states have call predecessors, (24), 17 states have call successors, (24) [2024-11-08 10:23:23,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 131 transitions. [2024-11-08 10:23:23,243 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 131 transitions. Word has length 44 [2024-11-08 10:23:23,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:23,243 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 131 transitions. [2024-11-08 10:23:23,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 9 states have internal predecessors, (28), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-08 10:23:23,244 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 131 transitions. [2024-11-08 10:23:23,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-08 10:23:23,245 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:23,245 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:23,251 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 (7)] Forceful destruction successful, exit code 0 [2024-11-08 10:23:23,446 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 10:23:23,446 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:23,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:23,447 INFO L85 PathProgramCache]: Analyzing trace with hash 595859751, now seen corresponding path program 1 times [2024-11-08 10:23:23,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 10:23:23,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [109357265] [2024-11-08 10:23:23,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:23,448 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 10:23:23,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 10:23:23,451 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 10:23:23,451 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 10:23:23,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 10:23:23,499 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-08 10:23:23,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 10:23:23,572 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-08 10:23:23,573 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 10:23:23,573 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 10:23:23,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [109357265] [2024-11-08 10:23:23,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [109357265] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 10:23:23,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 10:23:23,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 10:23:23,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892525933] [2024-11-08 10:23:23,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 10:23:23,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 10:23:23,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 10:23:23,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 10:23:23,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-08 10:23:23,575 INFO L87 Difference]: Start difference. First operand 100 states and 131 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 7 states have internal predecessors, (32), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-08 10:23:23,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 10:23:23,682 INFO L93 Difference]: Finished difference Result 158 states and 200 transitions. [2024-11-08 10:23:23,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 10:23:23,683 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 7 states have internal predecessors, (32), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 49 [2024-11-08 10:23:23,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 10:23:23,684 INFO L225 Difference]: With dead ends: 158 [2024-11-08 10:23:23,684 INFO L226 Difference]: Without dead ends: 121 [2024-11-08 10:23:23,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-08 10:23:23,686 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 14 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 10:23:23,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 521 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 10:23:23,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-08 10:23:23,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 107. [2024-11-08 10:23:23,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 79 states have (on average 1.2025316455696202) internal successors, (95), 81 states have internal predecessors, (95), 16 states have call successors, (16), 9 states have call predecessors, (16), 11 states have return successors, (20), 16 states have call predecessors, (20), 15 states have call successors, (20) [2024-11-08 10:23:23,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 131 transitions. [2024-11-08 10:23:23,710 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 131 transitions. Word has length 49 [2024-11-08 10:23:23,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 10:23:23,710 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 131 transitions. [2024-11-08 10:23:23,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 7 states have internal predecessors, (32), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-08 10:23:23,711 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 131 transitions. [2024-11-08 10:23:23,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-08 10:23:23,712 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 10:23:23,712 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:23,717 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 (8)] Ended with exit code 0 [2024-11-08 10:23:23,915 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 10:23:23,915 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 10:23:23,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 10:23:23,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1849173563, now seen corresponding path program 1 times [2024-11-08 10:23:23,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 10:23:23,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1361878964] [2024-11-08 10:23:23,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 10:23:23,917 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 10:23:23,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 10:23:23,919 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 10:23:23,922 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 10:23:23,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 10:23:23,969 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 10:23:23,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 10:23:24,049 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-08 10:23:24,049 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 10:23:24,050 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 10:23:24,059 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 (9)] Ended with exit code 0 [2024-11-08 10:23:24,258 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 10:23:24,262 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1] [2024-11-08 10:23:24,285 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 10:23:24,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 10:23:24 BoogieIcfgContainer [2024-11-08 10:23:24,288 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 10:23:24,288 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 10:23:24,288 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 10:23:24,288 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 10:23:24,288 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:23:19" (3/4) ... [2024-11-08 10:23:24,289 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-08 10:23:24,339 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 10:23:24,339 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 10:23:24,340 INFO L158 Benchmark]: Toolchain (without parser) took 5377.69ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 31.5MB in the beginning and 56.9MB in the end (delta: -25.3MB). Peak memory consumption was 23.2MB. Max. memory is 16.1GB. [2024-11-08 10:23:24,340 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 52.4MB. Free memory is still 35.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 10:23:24,340 INFO L158 Benchmark]: CACSL2BoogieTranslator took 362.89ms. Allocated memory is still 65.0MB. Free memory was 31.3MB in the beginning and 31.7MB in the end (delta: -400.5kB). Peak memory consumption was 2.9MB. Max. memory is 16.1GB. [2024-11-08 10:23:24,341 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.98ms. Allocated memory is still 65.0MB. Free memory was 31.7MB in the beginning and 30.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 10:23:24,341 INFO L158 Benchmark]: Boogie Preprocessor took 48.22ms. Allocated memory is still 65.0MB. Free memory was 30.3MB in the beginning and 27.9MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 10:23:24,341 INFO L158 Benchmark]: RCFGBuilder took 433.77ms. Allocated memory is still 65.0MB. Free memory was 27.9MB in the beginning and 33.2MB in the end (delta: -5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 10:23:24,342 INFO L158 Benchmark]: TraceAbstraction took 4440.03ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 32.5MB in the beginning and 28.6MB in the end (delta: 3.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 10:23:24,342 INFO L158 Benchmark]: Witness Printer took 51.49ms. Allocated memory is still 79.7MB. Free memory was 28.6MB in the beginning and 56.9MB in the end (delta: -28.3MB). Peak memory consumption was 5.8MB. Max. memory is 16.1GB. [2024-11-08 10:23:24,343 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.17ms. Allocated memory is still 52.4MB. Free memory is still 35.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 362.89ms. Allocated memory is still 65.0MB. Free memory was 31.3MB in the beginning and 31.7MB in the end (delta: -400.5kB). Peak memory consumption was 2.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.98ms. Allocated memory is still 65.0MB. Free memory was 31.7MB in the beginning and 30.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 48.22ms. Allocated memory is still 65.0MB. Free memory was 30.3MB in the beginning and 27.9MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 433.77ms. Allocated memory is still 65.0MB. Free memory was 27.9MB in the beginning and 33.2MB in the end (delta: -5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 4440.03ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 32.5MB in the beginning and 28.6MB in the end (delta: 3.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Witness Printer took 51.49ms. Allocated memory is still 79.7MB. Free memory was 28.6MB in the beginning and 56.9MB in the end (delta: -28.3MB). Peak memory consumption was 5.8MB. 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 - CounterExampleResult [Line: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L226] unsigned int a ; [L227] unsigned int ma = __VERIFIER_nondet_uint(); [L228] signed char ea = __VERIFIER_nondet_char(); [L229] unsigned int b ; [L230] unsigned int mb = __VERIFIER_nondet_uint(); [L231] signed char eb = __VERIFIER_nondet_char(); [L232] unsigned int r_add1 ; [L233] unsigned int r_add2 ; [L234] unsigned int zero ; [L235] int tmp ; [L236] int tmp___0 ; [L237] int __retres14 ; [L241] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, e=0] [L241] RET, EXPR base2flt(0, 0) [L241] zero = base2flt(0, 0) [L242] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=0, \old(m)=16777216] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L29] COND FALSE !(! m) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L57] COND TRUE 1 VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=0, \old(m)=16777216, e=0, m=16777216] [L76] m = m & ~ (1U << 24U) [L77] res = m | ((unsigned int )(e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=0, \old(m)=16777216, __retres4=-2147483648] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=16777216, \result=-2147483648] [L242] RET, EXPR base2flt(ma, ea) VAL [ea=0, ma=16777216] [L242] a = base2flt(ma, ea) [L243] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=64, \old(m)=16777216] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=64, \old(m)=16777216, e=64, m=16777216] [L29] COND FALSE !(! m) VAL [\old(e)=64, \old(m)=16777216, e=64, m=16777216] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=64, \old(m)=16777216, e=64, m=16777216] [L57] COND TRUE 1 VAL [\old(e)=64, \old(m)=16777216, e=64, m=16777216] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=64, \old(m)=16777216, e=64, m=16777216] [L76] m = m & ~ (1U << 24U) [L77] res = m | ((unsigned int )(e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=64, \old(m)=16777216, __retres4=-1073741824] [L80] return (__retres4); VAL [\old(e)=64, \old(m)=16777216, \result=-1073741824] [L243] RET, EXPR base2flt(mb, eb) VAL [a=-2147483648, ea=0, eb=64, ma=16777216, mb=16777216] [L243] b = base2flt(mb, eb) [L244] CALL addflt(a, b) VAL [\old(a)=-2147483648, \old(b)=-1073741824] [L84] unsigned int res ; [L85] unsigned int ma ; [L86] unsigned int mb ; [L87] unsigned int delta ; [L88] int ea ; [L89] int eb ; [L90] unsigned int tmp ; [L91] unsigned int __retres10 ; VAL [\old(a)=-2147483648, \old(b)=-1073741824, a=-2147483648, b=-1073741824] [L94] COND TRUE a < b [L95] tmp = a [L96] a = b [L97] b = tmp VAL [\old(a)=-2147483648, \old(b)=-1073741824, a=-1073741824, b=-2147483648] [L101] COND FALSE !(! b) [L108] ma = a & ((1U << 24U) - 1U) [L109] ea = (int )(a >> 24U) - 128 [L110] ma = ma | (1U << 24U) [L111] mb = b & ((1U << 24U) - 1U) [L112] eb = (int )(b >> 24U) - 128 [L113] mb = mb | (1U << 24U) VAL [\old(a)=-2147483648, \old(b)=-1073741824, a=-1073741824, ea=64, eb=0, ma=16777216, mb=16777216] [L114] CALL __VERIFIER_assert(ea >= eb) VAL [\old(cond)=1] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L114] RET __VERIFIER_assert(ea >= eb) VAL [\old(a)=-2147483648, \old(b)=-1073741824, a=-1073741824, ea=64, eb=0, ma=16777216, mb=16777216] [L115] delta = ea - eb VAL [\old(a)=-2147483648, \old(b)=-1073741824, a=-1073741824, delta=64, ea=64, ma=16777216, mb=16777216] [L116] CALL __VERIFIER_assert(delta < sizeof(mb) * 8) VAL [\old(cond)=0] [L16] COND TRUE !(cond) VAL [\old(cond)=0] [L17] reach_error() VAL [\old(cond)=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.3s, OverallIterations: 8, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 97 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 83 mSDsluCounter, 3111 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2656 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 502 IncrementalHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 455 mSDtfsCounter, 502 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 353 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=7, InterpolantAutomatonStates: 59, 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, 7 MinimizatonAttempts, 67 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 321 NumberOfCodeBlocks, 303 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 341 ConstructedInterpolants, 2 QuantifiedInterpolants, 541 SizeOfPredicates, 10 NumberOfNonLiveVariables, 535 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 148/160 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 proved your program to be incorrect! [2024-11-08 10:23:24,375 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 Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE